Dynamic output-sensitive hidden surface removal for c-oriented polyhedra
نویسندگان
چکیده
منابع مشابه
Dynamic Output-sensitive Hidden Surface Removal for C-oriented Polyhedra
In this paper we present an output-sensitive algorithm to maintain the view of a set of c-oriented polyhedra under insertions into or deletions from the set. (A set of polyhedra is c-oriented ifthe number of different orientations of its edges is bounded by some constant c.) Cyclic overlap in the scene is aJlowed and the polyhedra may even intersect. The time needed for an update is 0« k + 1) l...
متن کاملHidden Surface Removal for C-oriented Polyhedra
In this paper we present anew, efficient, output-sensitive method for computing the visibility map of a set of c-oriented polyhedra (polyhedra with their faces and edges in c orientations, for some constant c) as seen from a given viewpoint. For non-intersecting polyhedra with n edges in total, the algorithm runs in time 0« n + k) log n), where k is the complexity ofthe visibility map. The meth...
متن کاملRepetitive Hidden Surface Removal for Polyhedra
The repetitive hidden-surface-removal problem can be rephrased as the problem of nding the most compact representation of all views of a polyhedral scene that allows eecient on-line retrieval of a single view. In this paper we present a novel approach to this problem. We assume that a polyhedral scene in 3-space is given in advance and is preprocessed oo-line into a data structure. Afterwards, ...
متن کاملOutput-Sensitive Methods for Rectilinear Hidden Surface Removal
Mark H. Overmars§ We present an algorithm for the hidden-surface elimination problem for rectangles, which is also known as window rendering. The time complexity of OUI algorithm is dependent on both the number of input rectangles, n, and on the size of the output, k. Our algorithm obtains a hade-off between these two components, in that its running time is O(r(nI+l/T" + k», where 1 5 r :S log ...
متن کاملOutput-Sensitive Hidden Surface Elimination for Rectangles
We present an algorithm for the well-known bidden·surface elimination problem for redangles, which is also known as the window rendering problem. The time complexity of our algorithm is sensitive to the size of the output. Specifically, it runs in time that is O(n1.5 + k), where k is the size of the output (which can be as large as 6(n2 )). For values of kin the range between n1.5jlog nand n2 ,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 1992
ISSN: 0925-7721
DOI: 10.1016/0925-7721(92)90004-c